Implementing logical connectives in constraint programming
نویسندگان
چکیده
منابع مشابه
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language. We explore the solver architecture needed to propagate such combinations of constraints efficiently. In particular we describe two new features named satisfying sets and constraint trees. We also make use of movable ...
متن کاملImplementing Randomised Algorithms in Constraint Logic Programming
Synopsis Algorithms where the ow of information is determined by an element of random choice (a \coin ipping" device), aka randomised algorithms, have known in the last decade a tremendous growth of interest, especially in the eld of complexity theory. Up to now such algorithms have been implemented mostly by means of probabilistic programs written in imperative languages. These programs have b...
متن کاملA Logical View of Concurrent Constraint Programming
Concurrent Constraint Programming (CCP) has been the subject of growing interest as the focus of a new paradigm for concurrent computation. Like logic programming it claims close relations to logic. In fact CCP languages are logics in a certain sense that we make precise in this paper. In recent work it was shown that the denotational semantics of determinate concurrent constraint programming l...
متن کاملMental representation of logical connectives.
Logical connectives, such as "AND", "OR", "IF. THEN", and "IF AND ONLY IF" are ubiquitous in both language and cognition; however, reasoning with logical connectives is error-prone. We argue that some of these errors may stem from people's tendency to minimize the number of possibilities compatible with logical connectives and to construct a "minimalist" one-possibility representation. As a res...
متن کاملImplementing Type Theory in Higher Order Constraint Logic Programming
In this paper we are interested in high-level programming languages to implement the core components of an interactive theorem prover for a dependently typed language: the kernel — responsible for type-checking closed terms — and the elaborator — that manipulates terms with holes or, equivalently, partial proof terms. In the first part of the paper we confirm that λProlog, the language develope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2010
ISSN: 0004-3702
DOI: 10.1016/j.artint.2010.07.001